Hierarchically Nested Convex VCSP
نویسندگان
چکیده
We introduce tractable classes of VCSP instances based on convex cost functions. Firstly, we show that the class of VCSP instances satisfying the hierarchically nested convexity property is tractable. This class generalises our recent results on VCSP instances satisfying the non-overlapping convexity property by dropping the assumption that the input functions are non-decreasing [3]. Not only do we generalise the tractable class from [3], but also our algorithm has better running time compared to the algorithm from [3]. We present several examples of applications including soft hierarchical global cardinality constraints, useful in rostering problems. We go on to show that, over Boolean domains, it is possible to determine in polynomial time whether there exists some subset of the constraints such that the VCSP satisfies the hierarchically nested convexity property after renaming the variables in these
منابع مشابه
Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection
A binary VCSP is a general framework for the minimization problem of a function represented as the sum of unary and binary cost functions. An important line of VCSP research is to investigate what functions can be solved in polynomial time. Cooper–Živný classified the tractability of binary VCSP instances according to the concept of “triangle,” and showed that the only interesting tractable cas...
متن کاملIT: Machine Independent Programming on Hierarchically Nested Machines
APA Citation: Yanhaona, M & Grimshaw, A.(2016). IT: Machine Independent Programming on Hierarchically Nested Machines. University of Virginia Dept. of Computer Science Tech Report. Retrieved from http://libra.virginia.edu/catalog/libra-oa:10931 Accessed: November 21, 2017 Permanent URL: http://libra.virginia.edu/catalog/libra-oa:10931
متن کاملReversible Image Merging for Low-level Machine Vision
In this paper a hierarchical model for pixel clustering and image segmentation is developed. In the model an image is hierarchically structured. The original image is treated as a set of nested images, which are capable to reversibly merge with each other. An object is defined as a structural element of an image, so that, an image is regarded as a maximal object. The simulating of none-hierarch...
متن کاملDrawing the almost convex set in an integer grid of minimum size
In 2001, Károlyi, Pach and Tóth introduced a family of point sets to solve an Erdős-Szekeres type problem; which have been used to solve several other Edős-Szekeres type problems. In this paper we refer to these sets as nested almost convex sets. A nested almost convex set X has the property that the interior of every triangle determined by three points in the same convex layer of X , contains ...
متن کاملBackdoors to Tractable Valued CSP
We extend the notion of a strong backdoor from the CSP setting to the Valued CSP setting (VCSP, for short). This provides a means for augmenting a class of tractable VCSP instances to instances that are outside the class but of small distance to the class, where the distance is measured in terms of the size of a smallest backdoor. We establish that VCSP is fixed-parameter tractable when paramet...
متن کامل